Analysis of a Fault-Tolerant Multiprocessor Scheduling Algorithm

Fault tolerance is an important aspect of real-time computer systems, since timing constraints must not be violated. When dealing with multiprocessor systems, fault tolerance becomes an even greater requirement, since there are more components that can fail. In this paper, we present the analysis of a faulttolerant scheduling algorithm for real-time applications on multiprocessors. Our algorithm is based on the principles of primary/backup tasks, backup overloading (i.e., scheduling more than a single backup in the same time interval), and backup deallocation (i.e., reclaiming the resources unused by backup tasks in case of fault-free operation). A theoretical model is developed to study a particular class of applications and certain backup and overloading strategies. The proposed scheme can tolerate a single fault of any processor at any time, be it transient or permanent. Simulation results o er evidence of little loss of schedulability due to the addition of the fault tolerance capability. Simulation is also used to study the length of time needed for the system to recover from a fault (i.e., the time when the system is again able to tolerate any fault).